Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider regular expression r, where r = (11 ...
Start Learning for Free
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:
- a)NFA – 3, DFA – 4
- b)NFA – 3, DFA – 3
- c)NFA – 3, DFA – 3
- d)NFA – 4, DFA – 4
Correct answer is option 'A'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0,...
NFA - 3 ,DFA - 4
Most Upvoted Answer
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0,...
Solution:
Regular expression: r = (11 111)* over = {0, 1}
NFA Construction:
- Start by creating a start state q0 and an accept state q2.
- For the regular expression (11), we can create a simple two-state NFA with a transition on input 1 from q0 to q1, and a transition on input 1 from q1 to q2.
- For the regular expression (111), we can create a three-state NFA with a transition on input 1 from q0 to q1, a transition on input 1 from q1 to q2, and a transition on input 1 from q2 to q3.
- To combine the two regular expressions, we can create a new start state q' and epsilon transitions from q' to q0 and q', and from q2 to q'.
- The resulting NFA has three states - q', q0 and q2.
DFA Construction:
- Start by creating a start state q0 and an accept state q2.
- For the regular expression (11), we can create a simple two-state DFA with a transition on input 1 from q0 to q1, and a transition on input 1 from q1 to q2.
- For the regular expression (111), we can create a three-state DFA with a transition on input 1 from q0 to q1, a transition on input 1 from q1 to q2, and a transition on input 1 from q2 to q3.
- To combine the two regular expressions, we can create a new start state q' and transitions from q' to q0 and q' to q2 on input 1, and transitions from q0 to q1 and q1 to q2 on input 1.
- The resulting DFA has four states - q', q0, q1 and q2.
Therefore, the correct answer is option A.
Regular expression: r = (11 111)* over = {0, 1}
NFA Construction:
- Start by creating a start state q0 and an accept state q2.
- For the regular expression (11), we can create a simple two-state NFA with a transition on input 1 from q0 to q1, and a transition on input 1 from q1 to q2.
- For the regular expression (111), we can create a three-state NFA with a transition on input 1 from q0 to q1, a transition on input 1 from q1 to q2, and a transition on input 1 from q2 to q3.
- To combine the two regular expressions, we can create a new start state q' and epsilon transitions from q' to q0 and q', and from q2 to q'.
- The resulting NFA has three states - q', q0 and q2.
DFA Construction:
- Start by creating a start state q0 and an accept state q2.
- For the regular expression (11), we can create a simple two-state DFA with a transition on input 1 from q0 to q1, and a transition on input 1 from q1 to q2.
- For the regular expression (111), we can create a three-state DFA with a transition on input 1 from q0 to q1, a transition on input 1 from q1 to q2, and a transition on input 1 from q2 to q3.
- To combine the two regular expressions, we can create a new start state q' and transitions from q' to q0 and q' to q2 on input 1, and transitions from q0 to q1 and q1 to q2 on input 1.
- The resulting DFA has four states - q', q0, q1 and q2.
Therefore, the correct answer is option A.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer?
Question Description
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer?.
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer?.
Solutions for Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer?, a detailed solution for Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer? has been provided alongside types of Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:a)NFA – 3, DFA – 4b)NFA – 3, DFA – 3c)NFA – 3, DFA – 3d)NFA – 4, DFA – 4Correct answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup